A novel cache mechanism

This cache mechanism is transparent but does not contain associative circuits. It does not rely on locality of reference of instructions or data. No redundant instructions or data are encached. Items in the cache are accessed without address arithmetic. A cache miss is detected by the simplest test; compare two bits. These features would result in faster access, higher hit rate, reduced chip area, and less power dissipation in comparison with associative systems of similar size

Complex-linear invariants of biochemical networks

The nonlinearities found in molecular networks usually prevent mathematical analysis of network behaviour, which has largely been studied by numerical simulation. This can lead to difficult problems of parameter determination. However, molecular networks give rise, through mass-action kinetics, to polynomial dynamical systems, whose steady states are zeros of a set of polynomial equations. These equations may be analysed by algebraic methods, in which parameters are treated as symbolic expressions whose numerical values do not have to be known in advance. For instance, an "invariant" of a network is a polynomial expression on selected state variables that vanishes in any steady state. Invariants have been found that encode key network properties and that discriminate between different network structures. Although invariants may be calculated by computational algebraic methods, such as Gr\"obner bases, these become computationally infeasible for biologically realistic networks. Here, we exploit Chemical Reaction Network Theory (CRNT) to develop an efficient procedure for calculating invariants that are linear combinations of "complexes", or the monomials coming from mass action. We show how this procedure can be used in proving earlier results of Horn and Jackson and of Shinar and Feinberg for networks of deficiency at most one. We then apply our method to enzyme bifunctionality, including the bacterial EnvZ/OmpR osmolarity regulator and the mammalian 6-phosphofructo-2-kinase/fructose-2,6-bisphosphatase glycolytic regulator, whose networks have deficiencies up to four. We show that bifunctionality leads to different forms of concentration control that are robust to changes in initial conditions or total amounts. Finally, we outline a systematic procedure for using complex-linear invariants to analyse molecular networks of any deficiency.Comment: 36 pages, 6 figure

Introducing New Methodologies for Identifying Design Patterns for Internationalization and Localization

This paper describes a new methodology for deriving interaction design patterns from an analysis of ethnographic data. It suggests using inductive and deductive analysis processes to identify and articulate patterns that address the needs of culturally diverse users of interactive, collaborative systems. This might inform the internationalization and localization process of computer supported collaboration systems

Novel autoantibodies and clinical phenotypes in adult and juvenile myositis

Autoantibodies targeting intracellular proteins involved in key processes are detected in patients with idiopathic inflammatory myopathies. These myositisspecific autoantibodies have been increasingly demonstrated to correlate with distinct clinical phenotypes within the myositis spectrum. This review highlights the clinical associations of the myositisspecific autoantibodies, with particular attention to the recently identified and characterized novel myositis autoantibodies: p155/140, p140 (MJ), CADM-140 (MDA5), SAE, and 200/100

The horofunction boundary of the Hilbert geometry

We investigate the horofunction boundary of the Hilbert geometry defined on an arbitrary finite-dimensional bounded convex domain D. We determine its set of Busemann points, which are those points that are the limits of `almost-geodesics'. In addition, we show that any sequence of points converging to a point in the horofunction boundary also converges in the usual sense to a point in the Euclidean boundary of D. We prove that all horofunctions are Busemann points if and only if the set of extreme sets of the polar of D is closed in the Painleve-Kuratowski topology.Comment: 24 pages, 2 figures; minor changes, examples adde

A discourse analysis of trainee teacher identity in online discussion forums

Teacher education involves an identity transformation for trainees from being a student to being a teacher. This discourse analysis examined the online discussion board communications of a cohort of trainee teachers to better understand the situated identities of the trainees and how they were presented online. Their discussion board posts were the primary method of communication during placement periods and, as such, provided insight into how the trainees situated their identities in terms of being a student or being a teacher. During the analysis, the community boundaries, language and culture were explored along with the tutor's power and role in the identity transformation process. This involved looking at the lexis used by the students, the use of pronouns to refer to themselves and others such as teachers and pupils, the types of messages allowed in the community and the effect of the tutor's messages on their communication. The research found that the trainees felt comfortable with teaching but did not feel like teachers during the course. Tutors and school teachers need to develop an awareness of the dual nature of trainees' identities and help promote the transition from student to teacher. In the beginning of the course, trainees should be familiarised with teacher vocabulary and practical concepts in addition to pedagogical theory. Towards the end of the course, trainee identity as teachers could be promoted through the use of authentic assessments that mirror real teacher tasks and requirements

Small irrigation tanks as a source of malaria mosquito vectors: a study in north-central Sri Lanka

Watersheds / Tank irrigation / Rehabilitation / Malaria / Waterborne diseases / Disease vectors / Sri Lanka / Yan Oya

Dissecting the sharp response of a canonical developmental enhancer reveals multiple sources of cooperativity.

Developmental enhancers integrate graded concentrations of transcription factors (TFs) to create sharp gene expression boundaries. Here we examine the hunchback P2 (HbP2) enhancer which drives a sharp expression pattern in the Drosophila blastoderm embryo in response to the transcriptional activator Bicoid (Bcd). We systematically interrogate cis and trans factors that influence the shape and position of expression driven by HbP2, and find that the prevailing model, based on pairwise cooperative binding of Bcd to HbP2 is not adequate. We demonstrate that other proteins, such as pioneer factors, Mediator and histone modifiers influence the shape and position of the HbP2 expression pattern. Comparing our results to theory reveals how higher-order cooperativity and energy expenditure impact boundary location and sharpness. Our results emphasize that the bacterial view of transcription regulation, where pairwise interactions between regulatory proteins dominate, must be reexamined in animals, where multiple molecular mechanisms collaborate to shape the gene regulatory function

Trace Spaces: an Efficient New Technique for State-Space Reduction

State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put in parallel, without changing the semantics. It is thus not necessary to consider all execution paths in the interleaving semantics of a concurrent program, but rather some equivalence classes. The purpose of this paper is to describe a new algorithm to compute such equivalence classes, and a representative per class, which is based on ideas originating in algebraic topology. We introduce a geometric semantics of concurrent languages, where programs are interpreted as directed topological spaces, and study its properties in order to devise an algorithm for computing dihomotopy classes of execution paths. In particular, our algorithm is able to compute a control-flow graph for concurrent programs, possibly containing loops, which is "as reduced as possible" in the sense that it generates traces modulo equivalence. A preliminary implementation was achieved, showing promising results towards efficient methods to analyze concurrent programs, with very promising results compared to partial-order reduction techniques